An efficient approximation for the Generalized Assignment Problem
نویسندگان
چکیده
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the knapsack problem into an approximation algorithm for GAP. If the approximation ratio of the knapsack algorithm is α and its running time is O(f (N)), our algorithm guarantees a (1 + α)-approximation ratio, and it runs in O(M · f (N)+M ·N), where N is the number of items and M is the number of bins. Not only does our technique comprise a general interesting framework for the GAP problem; it also matches the best combinatorial approximation for this problem, with a much simpler algorithm and a better running time. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملAn improved pseudospectral approximation of generalized Burger-Huxley and Fitzhugh-Nagumo equations
In this research paper, an improved Chebyshev-Gauss-Lobatto pseudospectral approximation of nonlinear Burger-Huxley and Fitzhugh- Nagumo equations have been presented. The method employs chebyshev Gauss-Labatto points in time and space to obtain spectral accuracy. The mapping has introduced and transformed the initial-boundary value non-homogeneous problem to homogeneous problem. The main probl...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملAN ADAPTIVE WAVELET SOLUTION TO GENERALIZED STOKES PROBLEM
In this paper we will present an adaptive wavelet scheme to solvethe generalized Stokes problem. Using divergence free wavelets, theproblem is transformed into an equivalent matrix vector system, thatleads to a positive definite system of reduced size for thevelocity. This system is solved iteratively, where the applicationof the infinite stiffness matrix, that is sufficiently compressible,is r...
متن کاملExistence and Iterative Approximations of Solution for Generalized Yosida Approximation Operator
In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...
متن کاملEfficient Approximation Algorithms for Scheduling Unrelated Parallel Machines
Scheduling n independent jobs on m Unrelated Parallel Machines (SUM) is the problem of assigning n jobs j = 1, .., n to m machines i = 1, .., m so that each job is processed without interruption on one of the machines, and at any time, every machine processes at most one job. The objective is to minimize the makespan of the schedule. SUM is an NP-hard problem even when the number of machines is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 100 شماره
صفحات -
تاریخ انتشار 2006